MINLP Problems and Explanation-based Constraint Programming
نویسندگان
چکیده
Numerous industrial problems can be modelled as MINLP problems combining both numeric and integer variables. Several methods were proposed to solve these problems. But industrial applications need more than solving problems: dynamic problems, over-constrained problems, or explaining solver behaviour are features required by industrial applications. Explanation-based constraint programming offers such tools. In this paper, we show how to apply explanation-based mechanisms for mixed problems thanks to a generic framework. Last, some first experimental results are exposed: the overhead due to explanation managing is acceptable and can even speed up some resolutions.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSome Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme combining several methods, such as linear programming, interval analysis, and cutting methods. Our goal is to integrate constraint programming techniques in this framework. Firstly, global constraints can be introduced ...
متن کاملHeuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملThe PaLM system: explanation-based constraint programming
Explanation-based constraint programming is a new way of solving constraint problems: it allows to propagate constraints of the problem, learning from failure and from the solver (thanks to recording explanations) and nally allows to get rid of backtrack-based complete searches by allowing more free moves in the search space (while remaining complete). This paper presents the PaLM system, an im...
متن کامل